L-domains and Lossless Powerdomains
نویسنده
چکیده
The category of L-domains was discovered by A. Jung while solving the problem of nding maximal cartesian closed categories of algebraic CPO's and continuous functions. In this note we analyse properties of the lossless powerdo-main construction, that is closed on the algebraic L-domains. The powerdomain is shown to be isomorphic to a collection of subsets of the domain on which the construction was done. The proof motivates a certain niteness condition on the inconsistency relations of elements. It is shown that all algebraic CPO's D whose basis B(D) has property M satisfy the condition. In particular, the coherent L-domains satisfy the condition.
منابع مشابه
Reasoning with Powerdomains in Isabelle/HOLCF
This paper presents the first fully-mechanized formalization of powerdomains, implemented in the HOLCF logic of the Isabelle theorem prover. The powerdomain library provides an abstract view of powerdomains to the user, hiding the complicated implementation details. The library also provides proof automation, in the form of sets of rewrite rules for solving equalities and inequalities on powerd...
متن کاملSemantic Domains for Combining Probability and Non-Determinism
We present domain-theoretic models that support both probabilistic and nondeterministic choice. In [36], Morgan and McIver developed an ad hoc semantics for a simple imperative language with both probabilistic and nondeterministic choice operators over a discrete state space, using domaintheoretic tools. We present a model also using domain theory in the sense of D.S. Scott (see e.g. [15]), but...
متن کاملUnderapproximating Predicate Transformers
We study the underapproximation of the predicate transformers used to give semantics to the modalities in dynamic and temporal logic. Because predicate transformers operate on state sets, we define appropriate powerdomains for sound approximation. We study four such domains — two are based on “set inclusion” approximation, and two are based on “quantification” approximation — and we apply the d...
متن کاملA Logical Interpretation of Powerdomains
This paper characterizes the powerdomain constructions which have been used in the semantics of programming languages in terms of formulas of first order logic under a pre-ordering of provable implication. The goal is to reveal the basic logical significance of the powerdomains by casting them in the right setting. Such a treatment may contribute to a better understanding of their potential use...
متن کاملGeneralized ultrametric spaces : completion , topology , and powerdomains via the Yoneda embedding
Generalized ultrametric spaces are a common generalization of preorders and ordinary ultrametric spaces (Lawvere 1973, Rutten 1995). Combining Lawvere's (1973) enriched-categorical and Smyth' (1987, 1991) topological view on generalized (ultra)metric spaces, it is shown how to construct 1. completion, 2. topology, and 3. powerdomains for generalized ultrametric spaces. Restricted to the special...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989